Cyclic Sieving, Necklaces, and Branching Rules Related to Thrall's Problem
نویسندگان
چکیده
منابع مشابه
Cyclic Sieving for Cyclic Codes
These are notes on a preliminary follow-up to a question of Jim Propp, about cyclic sieving of cyclic codes. We show that two of the Mahonian polynomials are cyclic sieving polynomials for certain Dual Hamming Codes: X and X inv for q = 2, 3 and q = 2, respectively.
متن کاملThe cyclic sieving phenomenon
The cyclic sieving phenomenon is defined for generating functions of a set affording a cyclic group action, generalizing Stembridge’s q 1⁄4 1 phenomenon. The phenomenon is shown to appear in various situations, involving q-binomial coefficients, Pólya–Redfield theory, polygon dissections, noncrossing partitions, finite reflection groups, and some finite field q-analogues. r 2004 Elsevier Inc. A...
متن کاملCyclic Sieving and Cluster Multicomplexes
Reiner, Stanton, and White [10] proved results regarding the enumeration of polygon dissections up to rotational symmetry. Eu and Fu [2] generalized these results to Cartan-Killing types other than A by means of actions of deformed Coxeter elements on cluster complexes of Fomin and Zelevinsky [6]. The ReinerStanton-White and Eu-Fu results were proven using direct counting arguments. We give rep...
متن کاملCyclic Sieving of Matchings
Let Pn denote the poset of matchings on 2n points on a circle, labeled 1, 2, . . . , 2n in cyclic order, in which we define an element to be less than another element if it can be obtained by an uncrossing. Let Pn,k denote the level of the poset with k crossings. Let Pn,k denote the level of the poset with k crossings. We study the cyclic sieving phenomenon of Pn,k. It is known that the triple ...
متن کاملCyclic Sieving Phenomenon on Matchings
School of Mathematical and Statistical Sciences, Arizona State University Abstract. Reiner-Stanton-White defined the cyclic sieving phenomenon (CSP) associated to a finite cyclic group action on a finite set and a polynomial. Sagan observed the CSP on the set of non-crossing matchings on [2n] := {1, 2, . . . , 2n} using the cyclic group C2n generated by a cyclic shift of order 2n and the q-Cata...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/8198